Decomposition in general mathematical programming
نویسندگان
چکیده
منابع مشابه
Semistochastic decomposition scheme in mathematical programming and game theory
This work deals with the optimization problem sup inf S(x, y), which plays, undoubtedly xeX yeY a crucial part in mathematical programming and game theory. On the basis of probability theory, a solving approach — semistochastic decomposition is proposed. This method is finite with probability 1 without any hypothesis about convexity or differentiability as it is usually required in traditional ...
متن کاملSolving dynamic stochastic economic models by mathematical programming decomposition methods
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic problems are still quite challenging to solve. Economists are aware of the limitations of some of these approaches for solving these problems due to memory and computational requirements. However, many of the economic...
متن کاملSymmetry in Mathematical Programming
Symmetry is mainly exploited in mathematical programming in order to reduce the computation times of enumerative algorithms. The most widespread approach rests on: (a) finding symmetries in the problem instance; (b) reformulating the problem so that it does not allow some of the symmetric optima; (c) solving the modified problem. Sometimes (b) and (c) are performed concurrently: the solution al...
متن کاملReformulations in Mathematical Programming: Definitions
The mathematical programming formulation language is a very powerful tool used to formalize optimization problems by means of parameters, decision variables, objective functions and constraints. Such diverse settings as combinatorial, integer, continuous, linear and nonlinear optimization problems can be defined precisely by their corresponding mathematical programming formulations. Its power i...
متن کاملReformulations in Mathematical Programming: Symmetry
If a mathematical program (be it linear or nonlinear) has many symmetric optima, solving it via Branch-and-Bound techniques often yields search trees of disproportionate sizes; thus, finding and exploiting symmetries is an important task. We propose a method for: (a) automatically finding the formulation group of any given Mixed-Integer Nonlinear Program, and (b) reformulating the problem so th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1993
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01580620